High training set size reduction by space partitioning and prototype abstraction
نویسنده
چکیده
Instance-based learning methods like the nearest neighbour classiÿer generally suuer from the indiscriminate storage of all training instances, resulting in large memory requirements and slow execution speed. In this paper, new training set size reduction methods based on prototype generation and space partitioning are proposed. Experimental results show that the new algorithms achieve a very high reduction rate with still an important classiÿcation accuracy.
منابع مشابه
MODELING THE IMPACT OF PACKAGING DURING HIGH-LEVEL SYSTEM DESIGN: The Integration of Physical Partitioning Into Virtual Prototyping
As system designers strive to meet the conflicting objectives of cheaper, smaller, and faster electronic systems, the impact of packaging decisions on the design outcome is growing. As higher density systems become prevalent, virtual prototyping activities (functional decomposition, logical partitioning, hardware/software partitioning) must be integrated with physical implementation details at ...
متن کاملVerification of Component-Based Systems via Predicate Abstraction and Simultaneous Set Reduction
This paper presents a novel safety property verification approach for component-based systems modelled in BIP (Behaviour, Interaction and Priority), encompassing multiparty synchronisation with data transfer and priority. Our contributions consist of: (1) an on-the-fly lazy predicate abstraction technique for BIP; (2) a novel explicit state reduction technique, called simultaneous set reduction...
متن کاملAvalanche: an environment for design space exploration and optimization of low-power embedded systems
Power estimation and optimization has become a key issue in embedded system design, especially in the rapidly growing market of mobile handheld computing, communication, internet devices that are driven by battery power. It is of paramount importance to estimate and optimize power of those systems during an early design stage at a high level of abstraction in order to efficiently explore the de...
متن کاملTimed Game Abstraction of Control Systems
This paper proposes a method for abstracting control systems by timed game automata, and is aimed at obtaining automatic controller synthesis. The proposed abstraction is based on partitioning the state space of a control system using positive and negative invariant sets, generated by Lyapunov functions. This partitioning ensures that the vector field of the control system is transversal to the...
متن کاملEnhancing prototype reduction schemes with LVQ3-type algorithms
Various prototype reduction schemes have been reported in the literature. Foremost among these are the PNN, the VQ, and the SVM methods. In this paper, we shall show that these schemes can be enhanced by the introduction of a post-processing phase that is related, but not identical to, the LVQ3 process. Although the post-processing with LVQ3 has been reported for the SOM and the basic VQ method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition
دوره 37 شماره
صفحات -
تاریخ انتشار 2004